RAL - TR - 96 - 042 CLRC Methods for Nonlinear Constraints in Optimization Calculations
نویسندگان
چکیده
منابع مشابه
RAL - TR - 95 - 037 Constructing appropriate models for large - scale , linearly - constrained , nonconvex , nonlinear optimization algorithms
We consider the algebraic issues concerning the solution of general, large-scale, linearly constrained nonlinear optimization problems. Particular attention is given to suitable methods for solving the linear systems which occur at each iteration of such methods. The main issue addressed is how to ensure that a quadratic model of the objective function is positive definite in the null-space of ...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملSecondary Heavy Quark Pair Production in ee Annihilation
The multiplicity of heavy quarks from gluon splitting in ee annihilation has now been theoretically calculated and experimentally measured at LEP. However, the experimental measurement requires theoretical input for the shape of the multiplicity with respect to an event shape. In this paper we calculate the multiplicity of heavy quarks from gluon splitting in ee annihilation as a function of th...
متن کاملRAL 95-009 Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
ABSTRACT We consider the global and local convergence properties of a class of augmented Lagrangian methods for solving nonlinear programming problems. In these methods, linear and more general constraints are handled in different ways. The general constraints are combined with the objective function in an augmented Lagrangian. The iteration consists of solving a sequence of subproblems; in eac...
متن کاملRAL-TR-1998-069 On the solution of equality constrained quadratic programming problems arising in optimization
We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...
متن کامل